Left termination turned into termination

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducing AC-Termination to Termination

We present a new technique for proving AC-termination. We show that if certain conditions are met, AC-termination can be reduced to termination, i. e., termination of a TRS S modulo an AC-theory can be inferred from termination of another TRS R with no AC-theory involved. This is a new perspective and opens new possibilities to deal with AC-termination.

متن کامل

Proving Termination Through Conditional Termination

We present a constraint-based method for proving conditional termination of integer programs. Building on this, we construct a framework to prove (unconditional) program termination using a powerful mechanism to combine conditional termination proofs. Our key insight is that a conditional termination proof shows termination for a subset of program execution states which do not need to be consid...

متن کامل

Termination of Pregnancy with Prostaglandin

تاثیر تزریق داخل رحمی apGF2 و تزریق داخل وریدی اکسی توسین به عنوان دو روش درمانی در ختم حاملگی، در زنانی که در سه ماهه دوم بارداری دچار پارگی کیسه آب بودند، با یک دیگر مقایسه شده اند.

متن کامل

Probabilistic Termination Versus Fair Termination

In this paper we show that probabilistic termination of concurrent program is in many cases much simpler than the "f~" one. For a wide class of definitions of probabilistic termination we may express termination by rrf arithmetic formula, whereas the "fair" termination can be expressed only by rrf secqnd order arithmetic formula. Proof of "fair" termination usually needs induction on recursive ...

متن کامل

Termination

This survey describes methods for proving tha t systems of rewri te rules terminate . Illust ra t ions of the use of path orderings and other simplification orderings in terminat ion proofs are given. The effect of restrictions, such as l inearity, on the form of rules is considered. In general, though, te rminat ion is an undeeidable p roper ty of rewri te systems. 1. I N T R O D U C T I O N A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1994

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)90059-0